Math 202 - Assignment 7 Solutions

نویسنده

  • Rory Laster
چکیده

Exercise 10.3.2. Let R be a commutative ring with identity. For all positive integers n and m, R ∼= R if and only if n = m. Proof. Let φ : R → R be an isomorphism of R-modules and let I E R be a maximal ideal. Then the map φ̄ : R → R/IR given by φ̄(α) = φ(α) is a morphism of R-modules. Moreover ker φ̄ = {α ∈ R | φ̄(α) = 0} = {α ∈ R | φ(α) ∈ IR} = φ−1(IRm) = IR. Therefore by the first isomorphism theorem R/IR ∼= R/IR. We already showed that R/IR ∼= (R/I). Since I is maximal, F := R/I is a field and we have an isomorphism of F -vector spaces R/I) ∼= (R/I). Hence n = m.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Math 202 -assignment 7

a. N1 = {(i1, i2, . . . , in) : ik ∈ Ik for all k ∈ {1, 2, . . . , n}} and b. N2 = {(x1, x2, . . . , xn) : ∑n k=1 xk = 0}. Proof. To prove (a), it suffices to show, by Proposition 1, that N1 is nonempty and x + ry ∈ N1 for all r ∈ R and all x, y ∈ N1. For the first condition, (0, 0, . . . , 0) ∈ N1 since Ik is a subgroup of R containing the additive identity 0 for all k ∈ {1, 2, . . . , n}. Tha...

متن کامل

Semidefinite Programming

3 Why Use SDP? 5 3.1 Tractable Relaxations of Max-Cut . . . . . . . . . . . . . . . . . . . . . . . . 5 3.1.1 Simple Relaxation . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6 3.1.2 Trust Region Relaxation . . . . . . . . . . . . . . . . . . . . . . . . . 6 3.1.3 Box Constraint Relaxation . . . . . . . . . . . . . . . . . . . . . . . . 6 3.1.4 Eigenvalue Bound . . . . . . . . . . . . ...

متن کامل

Ergodic, primal convergence in dual subgradient schemes for convex programming

Lagrangean dualization and subgradient optimization techniques are frequently used within the field of computational optimization for finding approximate solutions to large, structured optimization problems. The dual subgradient scheme does not automatically produce primal feasible solutions; there is an abundance of techniques for computing such solutions (via penalty functions, tangential app...

متن کامل

Personnel assignment problem with hierarchical ordering constraints

Personnel assignment problem with hierarchical ordering constraints Hartford buffalo college essay easy way to write research paper apa format bibliography or works cited. Personnel assignment problem with hierarchical ordering constraints State of California ofac report car purchase Columbus, Abbotsford, Providence, nursing resume template monster Walsall personnel assignment problem with hier...

متن کامل

Classes of 3-Regular Graphs That Are (7, 2)-Edge-Choosable

A graph is (7, 2)-edge-choosable if, for every assignment of lists of size 7 to the edges, it is possible to choose two colors for each edge from its list so that no color is chosen for two incident edges. We show that every 3-edge-colorable graph is (7, 2)-edge-choosable and also that many non-3-edge-colorable 3-regular graphs are (7, 2)-edge-choosable.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014